Face Recognition using SIFT by varying Distance Calculation Matching Method
نویسنده
چکیده
Scale Invariant Feature Transform (SIFT) is a method for extracting distinctive invariant feature from images [1]. SIFT has been applied to many problems such as face recognition and object recognition [18], [19], [20], [21]. We have analyzed performance of SIFT using Euclidean distance as a matching algorithm. Further the matching rate can be enhanced/improved by changing distance calculation methods used for matching between two face images. So this paper also describes face recognition under various distance calculation methods like Correlation and Cosine. The experiments are conducted on different images of ORL face database [17] and Indian Face database [16] by changing illumination condition, scaling and rotation. From the experiments, it is shown that cosine and correlation distance calculation methods have performed well compared to the Euclidean distance matching method of original SIFT.
منابع مشابه
Experimental Investigation of Relation Between Near Neighbor Search Methods for Feature Vectors and Efficiency of Object Recognition
Efficiency of object recognition methods using local descriptors such as SIFT and PCA-SIFT depends largely on the speed of matching between feature vectors since images are described by a large number of feature vectors. Because the matching is considered to be “nearest neighbor (NN) search” of feature vectors, the problem is paraphrased by “how to make the NN search efficient”. For the object ...
متن کاملAdaptive Principle Component Analysis to Improve Scale Invariant Feature Transform Matching for Face Recognition Applications
Image matching using feature extraction is an important issue in computer vision tasks. The main drawback of matching process is the bottleneck problem that rapidly appeared when the number of features increased. This paper produced an adaptive approach to improve Scale Invariant Feature Transform (SIFT) matching. The main idea is to increase the number of SIFT points by using Adaptive PCA in w...
متن کاملNighttime Face Recognition at Long Distance: Cross-Distance and Cross-Spectral Matching
Automatic face recognition capability in surveillance systems is important for security applications. However, few studies have addressed the problem of outdoor face recognition at a long distance (over 100 meters) in both daytime and nighttime environments. In this paper, we first report on a system that we have designed to collect face image database at a long distance, called the Long Distan...
متن کاملA Method for Face Recognition from Facial Expression
Facial expressions play a major role in Face Recognition Systems and image processing techniques of Human Machine Interface. There are several techniques for facial features selection like Principal Component Analysis, Distance calculation among face components, Template Matching. This algorithm describes a simple template matching based facial feature selection technique and detects facial exp...
متن کاملFace and Iris Recognition in a Video Sequence Using Dbpnn and Adaptive Hamming Distance
Dense feature extraction is becoming increasingly popular in face recognition. Face recognition is a vital component for authorization and security. In earlier days, CCA (Canonical Correlation Analysis) and SIFT (Scale Invariant Feature Transforms) was used for face recognition. Since multi scale extraction is not possible with these existing methods, a new approach to dense feature extraction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012